A Declarative Language for the Coq Proof Assistant
نویسنده
چکیده
This paper presents a new proof language for the Coq proof assistant. This language uses the declarative style. It aims at providing a simple, natural and robust alternative to the existing Ltac tactic language. We give the syntax of our language, an informal description of its commands and its operational semantics. We explain how this language can be used to implement formal proof sketches. Finally, we present some extra features we wish to implement in the future.
منابع مشابه
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
We propose a synthesis of the two proof styles of interactive theorem proving: the procedural style (where proofs are scripts of commands, like in Coq) and the declarative style (where proofs are texts in a controlled natural language, like in Isabelle/Isar). Our approach combines the advantages of the declarative style – the possibility to write formal proofs like normal mathematical text – an...
متن کاملProofPeer - A Cloud-based Interactive Theorem Proving System
Probably the most popular ITP systems these days are Isabelle [4a] and Coq [5]. Isabelle is a descendant of Edinburgh LCF. Its declarative extension Isabelle/Isar [4b] has been heavily influenced by Mizar. Coq can be viewed as a descendant of the Automath system in that both systems are based on the Curry-Howard correspondence [6] (a proof is a program, the formula it proves is a type for the p...
متن کاملThe Gilbreath Trick: A case study in Axiomatisation and Proof Development in the Coq Proof Assistant
We present the full axiomatisation and proof development of a non-trivial property of binary sequences, inspired from a card trick of N. Gilbreath. This case study illustrates the power and naturalness of the Calculus of Inductive Constructions as a specification language, and outlines a uniform methodology for conducting inductive proofs in the Coq proof assistant.
متن کاملComputer Verified Exact Analysis (Tutorial)
This tutorial will illustrate how to use the Coq proof assistant to implement effective and provably correct computation for analysis. Coq provides a dependently typed functional programming language that allows users to specify both programs and formal proofs. We will introduce dependent type theory and show how it can be used to develop both mathematics and programming. We will show how to us...
متن کاملPartial Derivative Automata Formalized in Coq
In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the Coq proof assistant. This proof is part of a formalization of Kleene algebra and regular languages in Coq towards their usage in program certification.
متن کامل